The Diophantine equation $\alpha _{1}^{x_{1}}\cdots \alpha _{n}^{x_{n}} = f(x_{1},\dots ,x_{n})$. II
نویسندگان
چکیده
منابع مشابه
THE DIOPHANTINE EQUATION x2+2k =yn, II
New results regarding the full solution of the diophantine equationx2+2k=yn in positive integers are obtained. These support a previous conjecture, without providing a complete proof.
متن کاملThe comparison of alpha power, peak alpha frequency, frontal alpha asymmetry between irritable bowel syndrome and healthy people
Irritable bowel syndrome (IBS) is a chronic functional gastrointestinal disorder that is characterized by abdominal pain or discomfort and changed intestinal habits. The aim of This study was the comparison of features of brain oscillations in alpha frequency band by using rest-electroencephalography (EEG) between patients with IBS and healthy control. 11 IBS patients (7 female and 4 male) and ...
متن کاملOn the Diophantine Equation
= c for some integers a, b, c with ab 6= 0, has only finitely many integer solutions. Stoll & Tichy proved more generally that if a, b, c ∈ Q and ab 6= 0, then for m > n ≥ 3, the above equation has only finitely many integral solutions x, y. Independently, Rakaczki established a more precise finiteness result on this binomial equation and extended this result to more general equations (see Acta...
متن کاملOn the Diophantine Equation
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...
متن کاملOn the Diophantine Equation
In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2009
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-09-05012-0